On the Decidability of Continuous Time Speci cationFormalismsA
نویسنده
چکیده
We consider an interpretation of monadic second-order logic of order in the continuous time structure of nitely variable signals and show the decidability of monadic logic in this structure. The expressive power of monadic logic is illustrated by providing a straightforward meaning preserving translation into monadic logic of three typical continuous time speciication formalism: Temporal Logic of Reals 2], Restricted Duration Calculus 4], and the Propositional fragment of Mean Value Calculus 6]. As a by-product of the decidability of monadic logic we obtain that the above formalisms are decidable even when extended by quantiiers.
منابع مشابه
Continuous Petri Nets: Expressive Power and Decidability Issues
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected gains are twofold: improvements in comlexity and in decidability. This paper concentrates on the study of decidability issues. In the case of autonomous nets it is proved that properties like reachability, liveness o...
متن کاملSENSITIVITY ANALYSIS OF EFFICIENT AND INEFFICIENT UNITS IN INTEGER-VALUED DATA ENVELOPMENT ANALYSIS
One of the issues in Data Envelopment Analysis (DEA) is sensitivity and stability region of the speci c decision making unit (DMU), included ecient and inecient DMUs. In sensitivity analysis of ecient DMUs,the largest region should be found namely stability region thatdata variations are only for ecient DMU under evaluation and the data for the remainingDMUs are assumed xed. Also ecient DMU u...
متن کاملA Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of Higman, and on the Rabin tree theorem. In this way, we get purely logical, short proofs for some known facts on decidability, which might be of methodological interest. Our approach is also applicable to some other sim...
متن کاملDeciding Concurrent Planar Monotonic Linear Hybrid Systems
Decidability results for hybrid automata often exploit subtle properties about dimensionality (number of continuous variables), and interaction between discrete transitions and continuous trajectories of variables. Thus, the decidability results often do not carry over to parallel compositions of hybrid automata, even when there is no communication other than the implicit synchronization of tim...
متن کامل